Disjunctions with stopping conditions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Relevance Conditions for Asserting Disjunctions

Communication is a goal–directed activity. In general, it can serve multiple purposes, e.g. information transfer, expression of emotions, making promises,... According to H.P. Grice (1989), if communication is to be successful, the specific purpose of the communicative act has to be known and accepted by all participants. Hence, for a participant to be cooperative (i.e. willing to make the comm...

متن کامل

Disambiguating with Controlled Disjunctions

In this paper, we propose a disambiguating technique called controlled disjunctions. This extension of the so-called named disjunctions relies on the relations existing between feature values (covariation, control, etc.). We show that controlled disjunctions can implement different kind of ambiguities in a consistent and homogeneous way. We describe the integration of controlled disjunctions in...

متن کامل

Logic Programs with Annotated Disjunctions

Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, we introduce a new formalism, Logic Programs with Annotated Disjunctions, based on disjunctive logic programs. In this formalism, each of the disjuncts in the head of a clause is annotated with a probability. Viewing such ...

متن کامل

Promises and Threats with Conditionals and Disjunctions

With a conditional “If you do . . . , I’ll do . . . ” we can make promises and threats. But with a disjunction “You do . . . , or I’ll do . . . ” we can only make threats, no promises. We suggest that this so because disjunctive promises would be a suboptimal strategic commitment in a game-like situation where the speaker is trying to influence the hearer’s

متن کامل

Answering Queries Using Materialized Views with Disjunctions

We consider the problem of answering datalog queries using materialized views. More speciically, queries are rewritten to refer to views instead of the base relations over which the queries were originally written. Much work has been done on program rewriting that produces an equivalent query. In the context of information integration, though, the importance of using views to infer as many answ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Bulletin of Symbolic Logic

سال: 2021

ISSN: 1079-8986,1943-5894

DOI: 10.1017/bsl.2019.55